Shortest Path Planning for Energy-Constrained Mobile Platforms Navigating on Uneven Terrains

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pose estimation-based path planning for a tracked mobile robot traversing uneven terrains

Most path planners for ground mobile robots for traversing uneven terrains use single probabilistic measures that characterize the terrains alone considering at most the robot dimension to search for optimal paths. Though these measures can approximately give a sense of the terrain ruggedness or the traversal difficulty, they overlook the details on the interaction between the robot body and th...

متن کامل

Constrained Shortest Path Computation

This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a. A k-stops query retrieves a sequence that contains exactly k intermediate data points....

متن کامل

Acceleration of Shortest Path and Constrained Shortest Path Computation

We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries. We focus on two methods based on Dijkstra’s algorithm for sh...

متن کامل

Memory-Constrained Algorithms for Shortest Path Problem

We present an algorithm computing a shortest path between to vertices in a square grid graph with edge weights that uses memory less than linear in the number of vertices (apart from that for storing in the input). For any ε > 0, our algorithm uses a work space of O(n) words and runs in O(n) time.

متن کامل

Shortest Anisotropic Paths on Terrains

We discuss the problem of computing shortest an-isotropic paths on terrains. Anisotropic path costs take into account the length of the path traveled, possibly weighted, and the direction of travel along the faces of the terrain. Considering faces to be weighted has added realism to the study of (pure) Euclidean shortest paths. Parameters such as the varied nature of the terrain, friction, or s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Industrial Informatics

سال: 2018

ISSN: 1551-3203,1941-0050

DOI: 10.1109/tii.2018.2844370